Relaxed Alternating Projection Methods
نویسندگان
چکیده
In this paper we deal with the von Neumann alternating projection method xk+1 = PAPBxk and with its generalization of the form xk+1 = PA(xk + k(PAPBxk xk)), where A;B are closed and convex subsets of a Hilbert space H and FixPAPB 6= ?. We do not suppose that A \ B 6= ?. We give su¢ cient conditions for the weak convergence of the sequence (xk) to FixPAPB in the general case and in the case A is a closed a¢ ne subspace. We present also the results of preliminary numerical experiments. Key words: alternating projection method, Fejér monotonicity, weak convergence AMS Subject Classi cation: 65K05 1. Introduction Let H be a real Hilbert space equipped with a scalar product h ; i and with the norm k k induced by h ; i. Further, let A;B H be nonempty, convex and closed subsets. In the practical considerations one often needs to nd an element of the intersection A \ B or, more general, to solve the following problem nd a 2 A and b 2 B such that ka b k = inf a2A;b2B ka bk: (1)
منابع مشابه
A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملFinding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
We study the convergence of an iterative projection/reflection algorithm originally proposed for solving what are known as phase retrieval problems in optics. There are two features that frustrate any analysis of iterative methods for solving the phase retrieval problem: nonconvexity and infeasibility. The algorithm that we developed, called Relaxed Averaged Alternating Reflections (RAAR), was ...
متن کاملOptimization Methods for Optimal Control of Nonlinear Elliptic Systems
We consider an optimal control problem for systems governed by a highly nonlinear second order elliptic partial differential equation, with control and state constraints. The problem is formulated in the classical and in the relaxed form, and various necessary conditions for optimality are given. For the numerical solution of these problems, we propose a penalized gradient projection method gen...
متن کاملRegularity of collections of sets and convergence of inexact alternating projections
We study the usage of regularity properties of collections of sets in convergence analysis of alternating projection methods for solving feasibility problems. Several equivalent characterizations of these properties are provided. Two settings of inexact alternating projections are considered and the corresponding convergence estimates are established and discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 19 شماره
صفحات -
تاریخ انتشار 2008